大规模电力系统不对称短路的分块射影解法

本文把网络的分块射影法用于大规模电力系统不对称短路的分析计算。研究表明：该方法对短路计算是可行的。一旦求出了射影张量，即可重复用于后续的计算，只需改变故障所在的那一个子网络的射影张量。本文提出的网络分块射影算法为大规模电力系统的分析计算提供了一条崭新的途径。     

基于i860的存储器子系统设计

微处理机系统中的存储器子系统设计对整个系统性能的高低有重要的影响，尤其当微处理器的主频越来越高时。本文结合实际例子，给出了一个基于ｉ８６０处理器（４０ＭＨｚ）的主存设计方案，讨论了实际中需仔细考虑的因素。该设计可为其它高性能ＲＩＳＣ系统设计提供参考。     

一种新的机器人手臂控制方法

从机器人手臂的关节电机力学出发，本文提出了一种独立于现行机器人关节控制器的离线补偿方法，通过对－２自由度机器人的数值研究，证明该法不仅能有效地克服由于惯性负载，关节间耦合与重力效应给控制系统带来的动态精度问题，而且还可以消除由于控制系统本身的固有特性所决定的系统的跟踪误差。     

误差通道建模误差对多误差LMS算法性能的影响

本文证明了，在多通道自适应宽带有源噪声控制中，由于误差通道建模误差的存在，多误差LMS算法是条件收敛的，并推导了保证算法收敛的条件，还证明了，算法收敛后，得到自适应滤波器权值一般只是理论上最优值的有偏估计，计算机仿真结果验证了所得结论．     

R∞关系的几个重要性质

在二元关系R的基础上构造了R^∞关系，给出并证明了R^∞关系的几个重要性质。这些性质在粗糙集理论中研究R^∞领域系统及其近似算子时甚为重要。     

低损耗电压频率比控制的变频调速系统性能仿真研究

本文从满足调速范围及最小铜、铁耗总和出发，推导了考虑主磁路饱和的电机数学模型，研究了电压频率比的控制规律，同时对系统脉动转矩进行了准确分析，并利用改进后的电压频率比控制规律，对实际电机进行了调速性能的仿真计算。结果表明，采用电压频率比不为常数的控制，拓宽了调速范围，提高了电机在调速过程中的效率，降低了轻载低速时的转速脉动，对变频器控制规律与电机的配合提供了理论基础。     

自主车辆越野路径规划的新方法——领域式规划法

本文提出了一种解决 ALV(Autonomous Land Vehicle)越野路径规划的新途径——领域式规划法.介绍了一种面向地形本身分布特点和性质的地形分割方法,讨论了领域式规划空间的二叉树表示方法.在此基础上,提出了采用虚拟矩阵匹配搜索二叉树以确定领域式规划空间中邻接关系的方法,并描述了启发式方法和概率方法相结合的路径搜索算法.领域式规划方法有效地解决了非结构化环境中的规划效率问题.     

一种新的改善机器人动态精度的方法

从机器人关节反馈控制系统模型出发,本文提出了一种利用补偿指令轨迹来改善机器人动态精度的方法,并指出了这一方法实施的全过程.利用这一方法对机器人实施控制,不仅可以从根本上克服由于重力负载和杆件离心效应等因素的干扰给控制系统带来的动态精度问题,而且还可消除由于反馈控制系统本身的固有特性所决定的系统的动态跟踪误差.通过在 PUMA560上的数值研究,证明了本文理论方法的正确性.     

An object design framework for structural engineering

Object-oriented principles have introduced several useful concepts for developing complex software systems. As a result, several methodologies have been suggested for the overall design of software systems based on these concepts. Methodologies and frameworks for designing objects that are to be part of the software systems are currently lacking. This paper proposes anobject design framework andmethodology, which utilizes the object-oriented concepts, for planning, organizing and designing structural engineering design objects. Design objects in an integrated structural engineering system are complex and often related to each other in various different ways. The paper also identifies several important relationships among structural engineering design objects. These relationships serve as communication channels through wich design objects send messages to and receive responses from each other. Several examples, drawn from reinforced concrete structures, will be presented to demonstrate the object design methodology and to illustrate how the framework is effective in reducing the complexity of design objects in an integrated structural engineering system.     

A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms

Recently, Chinn et al. [10] presented lower bounds for store-and-forward permutation routing algorithms on the n \times n mesh with bounded buffer size and where a packet must take a shortest (or minimal ) path to its destination. We extend their analysis to algorithms that are nearly minimal. We also apply this technique to the domain of hot potato algorithms, where there is no storage of packets and the shortest path to a destination is not assumed (and is in general impossible). We show that ``natural' variants and ``improvements' of several algorithms in the literature perform poorly in the worst case. As a result, we identify algorithmic features that are undesirable for worst-case hot potato permutation routing. Recent works in hot potato routing have tried to define simple and greedy classes of algorithms. We show that when an algorithm is too simple and too greedy, its performance in routing permutations is poor in the worst case. Specifically, the technique of [10] is also applicable to algorithms that do not necessarily send packets in minimal or even nearly minimal paths: it may be enough that they naively attempt to do so when possible. In particular, our results show that a certain class of greedy algorithms that was suggested recently by Ben-Dor et al. [6] contains algorithms that have poor performance in routing worst-case permutations. Received August 24, 1995; revised May 27, 1997.